Optimal and suboptimal algorithms in set membership identification
نویسندگان
چکیده
منابع مشابه
Optimal and Suboptimal Singleton Arc Consistency Algorithms
Singleton arc consistency (SAC) enhances the pruning capability of arc consistency by ensuring that the network cannot become arc inconsistent after the assignment of a value to a variable. Algorithms have already been proposed to enforce SAC, but they are far from optimal time complexity. We give a lower bound to the time complexity of enforcing SAC, and we propose an algorithm that achieves t...
متن کاملSet-Membership Constrained Conjugate Gradient Beamforming Algorithms
In this work a constrained adaptive filtering strategy based on conjugate gradient (CG) and set-membership (SM) techniques is presented for adaptive beamforming. A constraint on the magnitude of the array output is imposed to derive an adaptive algorithm that performs data-selective updates when calculating the beamformer’s parameters. We consider a linearly constrained minimum variance (LCMV) ...
متن کاملError bounds for conditional algorithms in restricted complexity set membership identification
Restricted complexity estimation is a major topic in control-oriented identi cation. Conditional algorithms are used to identify linear nite dimensional models of complex systems, the aim being to minimize the worst-case identi cation error. High computational complexity of optimal solutions suggests to employ suboptimal estimation algorithms. This paper studies di erent classes of conditional ...
متن کاملConditional central algorithms for worst case set-membership identification and filtering
This paper deals with conditional central estimators in a set membership setting. The role and importance of these algorithms in identification and filtering is illustrated by showing that problems like worst-case optimal identification and state filtering, in contexts where disturbances are described through norm bounds, are reducible to the computation of conditional central algorithms. The c...
متن کاملOptimal and suboptimal smoothing algorithms for identification of time-varying systems with randomly drifting parameters
Noncausal estimation algorithms, which involve smoothing, can be used for off-line identification of nonstationary systems. Since smoothing is based on both past and future data, it offers increased accuracy compared to causal (tracking) estimation schemes, incorporating past data only. It is shown that efficient smoothing variants of the popular exponentially weighted least squares and Kalman ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computer Modelling of Dynamical Systems
سال: 2005
ISSN: 1387-3954,1744-5051
DOI: 10.1080/13873950500068575